Mixminion: Strong Anonymity for Financial Cryptography

نویسندگان

  • Nick Mathewson
  • Roger Dingledine
چکیده

Anonymous communication is a valuable but underused tool for securing financial communications. As early as the first commercial telegraph codes, businesses have recognized the value of cryptography to protect their communication from prying eyes. But cryptography alone still allows adversaries to discover confidential business relationships by performing traffic analysis to reveal the presence of such communication. Mixminion is an open source, deployed system under active development. It resists known forms of traffic analysis, allowing parties to communicate without revealing their identities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixminion: Design of a Type III Anonymous Remailer Protocol

We present Mixminion, a message-based anonymous remailer protocol with secure single-use reply blocks. Mix nodes cannot distinguish Mixminion forward messages from reply messages, so forward and reply messages share the same anonymity set. We add directory servers that allow users to learn public keys and performance statistics of participating remailers, and we describe nymservers that provide...

متن کامل

The Effect of DNS on Tor’s Anonymity† (abstract)

We have yet to learn how to build anonymity networks that resist global adversaries, provide low latency, and scale well. Remailer systems such as Mixmaster [6] and Mixminion [1] eschew low latency in favor of strong anonymity. In contrast, Tor [2] trades off strong anonymity to achieve low latency; Tor therefore enables latencysensitive applications such as web browsing but is vulnerable to ad...

متن کامل

Calculating Probabilistic Anonymity from Sampled Data

This paper addresses the problem of calculating the anonymity of a system statistically from a number of trial runs. We show that measures of anonymity based on capacity can be estimated, by showing that the Blahut-Arimoto algorithm converges for sampled data. We obtain bounds on the error of the estimated value by calculating the distribution of mutual information when one distribution is know...

متن کامل

Footprint Scheduling for Dining-Cryptographer Networks

In many communication scenarios it is not sufficient to protect only the content of the communication, it is necessary to also protect the identity of communicating parties. Various protocols and technologies have been proposed to offer such protection, for example, anonymous proxies, mix-networks, or onion routing. The protocol that offers the strongest anonymity guarantees, namely uncondition...

متن کامل

A Model of Onion Routing with Provable Anonymity

Onion routing is a scheme for anonymous communication that is designed for practical use. It has not been modeled formally, however, and therefore its anonymity guarantees have not been rigorously analyzed. We give an IO-automata model of an onion-routing protocol and, under possibilistic definitions, characterize the situations in which anonymity and unlinkability are guaranteed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004